Spreads covered by derivable partial spreads
نویسندگان
چکیده
منابع مشابه
Blocking Sets and Derivable Partial Spreads
We prove that a GF(q)-linear Rédei blocking set of size qt + qt−1 + · · · + q + 1 of PG(2, qt ) defines a derivable partial spread of PG(2t − 1, q). Using such a relationship, we are able to prove that there are at least two inequivalent Rédei minimal blocking sets of size qt + qt−1 + · · · + q + 1 in PG(2, qt ), if t ≥ 4.
متن کاملOn linear partial spreads
A linear partial spread is a set of mutually skew lines of some P(V ) – where V is a finite dimensional vector space over a field – that are characterized by the property that their images under the Plücker embedding are in a given subspace of P (∧2 V ); it is a linear spread if the lines in it cover the whole space. We will provide methods to construct linear partial spreads, and characterize ...
متن کاملInfinite Maximal Partial Spreads
The concept of ‘critical deficiency’ of a finite net is generalized to the infinite case and a variety of infinite maximal partial spreads are constructed.
متن کاملMaximal Partial Spreads of Polar Spaces
Some constructions of maximal partial spreads of finite classical polar spaces are provided. In particular we show that, for n > 1, H(4n−1, q2) has a maximal partial spread of size q2n + 1, H(4n + 1, q2) has a maximal partial spread of size q2n+1 + 1 and, for n > 2, Q+(4n − 1, q), Q(4n − 2, q), W(4n − 1, q), q even, W(4n − 3, q), q even, have a maximal partial spread of size qn + 1.
متن کاملPartial spreads in random network coding
ABSTRACT. Following the approach by R. Kötter and F. R. Kschischang, we study network codes as families of k-dimensional linear subspaces of a vector space Fq , q being a prime power and Fq the finite field with q elements. In particular, following an idea in finite projective geometry, we introduce a class of network codes which we call partial spread codes. Partial spread codes naturally gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1985
ISSN: 0097-3165
DOI: 10.1016/0097-3165(85)90063-9